An Interpolation Algorithm for Sparse Polynomials overZm
نویسنده
چکیده
We give a quasi-polynomial time algorithm for the problem of interpolating sparse polynomials over integer residue class ringsZm from their values given by a black box. This is a further development of [10].
منابع مشابه
Sparse Polynomial Interpolation and the Fast Euclidean Algorithm
We introduce an algorithm to interpolate sparse multivariate polynomials with integer coefficients. Our algorithm modifies Ben-Or and Tiwari’s deterministic algorithm for interpolating over rings of characteristic zero to work modulo p, a smooth prime of our choice. We present benchmarks comparing our algorithm to Zippel’s probabilistic sparse interpolation algorithm, demonstrating that our alg...
متن کاملRandomized Interpolation and Approximation of Sparse Polynomials
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L 2 norm).
متن کاملAsymptotically Optimal Monte Carlo Sparse Multivariate Polynomial Interpolation Algorithms of Straight-Line Program
In this paper, we propose new deterministic interpolation algorithms and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let f be an n-variate polynomial with a degree bound D and and term bound T . Our deterministic algorithms have better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Ca...
متن کاملApproximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric interpolation on generalized sparse grids...
متن کاملSparse Polynomial Interpolation in Nonstandard Bases
In this paper, we consider the problem of interpolating univariate polynomials over a eld of characteristic zero that are sparse in (a) the Pochhammer basis or, (b) the Chebyshev basis. The polynomials are assumed to be given by black boxes, i.e., one can obtain the value of a polynomial at any point by querying its black box. We describe eecient new algorithms for these problems. Our algorithm...
متن کامل